Shortest Paths of Bounded Curvature for the Dubins Interval Problem
نویسندگان
چکیده
The Dubins interval problem aims to find the shortest path of bounded curvature between two targets such that the departure angle from the first target and the arrival angle at the second target are constrained to two respective intervals. We propose a new and a simple algorithm to this problem based on the minimum principle of Pontryagin.
منابع مشابه
Discrete Dubins Paths
A Dubins path is a shortest path with bounded curvature. The seminal result in nonholonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof uses advanced calculus; later, Dubins result was reproved using control theory technique...
متن کاملOn Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case
A shortest path joining two specified endpoint configurations that is constrained to have mean curvature at most ς on every non-zero length sub-path is called a ς-geodesic. A seminal result in non-holonomic motion planning is that (in the absence of obstacles) a 1-geodesic consists of either (i) a (unit-radius) circular arc followed by a straight segment followed by another circular arc, or (ii...
متن کاملBounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization
We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence of n points in the plane in a given order. This problem is a sub-problem of the Dubins Traveling Salesman Problem and also arises naturally in path planning for point car-like robots in the presence of polygonal obstacles. We show that when consecutive waypoints are distanc...
متن کاملClassification of the Dubins set
Given two points in a plane, each with a prescribed direction of motion in it, the question being asked is to find the shortest smooth path of bounded curvature that joins them. The classical 1957 result by Dubins gives a sufficient set of paths (each consisting of circular arcs and straight line segments) which always contains the shortest path. The latter is then found by explicitly computing...
متن کاملBounded-Curvature Shortest Paths through a Sequence of Points
We consider the problem of computing shortest paths, whose curvature is constrained to beat most one almost everywhere, and that visit a sequence of n points in the plane in a givenorder. This problem arises naturally in path planning for point car-like robots in the presenceof polygonal obstacles, and is also a sub-problem of the Dubins Traveling Salesman Problem.We show that, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.06980 شماره
صفحات -
تاریخ انتشار 2015